A Comparative Theoretical and Computational Study on Robust Counterpart Optimization: I. Robust Linear Optimization and Robust Mixed Integer Linear Optimization
نویسندگان
چکیده
منابع مشابه
A Comparative Theoretical and Computational Study on Robust Counterpart Optimization: III. Improving the Quality of Robust Solutions
In this paper, we study the solution quality of robust optimization problems when they are used to approximate probabilistic constraints and propose a novel method to improve the quality. Two solution frameworks are first compared: (1) the traditional robust optimization framework which only uses the a priori probability bounds and (3) the approximation framework which uses the a posteriori pro...
متن کاملRobust Linear Optimization With Recourse
We propose an approach to linear optimization with recourse that does not involve a probabilistic description of the uncertainty, and allows the decision-maker to adjust the degree of robustness of the model while preserving its linear properties. We model random variables as uncertain parameters belonging to a polyhedral uncertainty set and minimize the sum of the first-stage costs and the wor...
متن کاملRobust Linear Optimization and Chance Constraints
The question posed in the title of this section goes beyond general-type theoretical considerations — this is mainly a modeling issue that should be resolved on the basis of application-driven considerations. There is however a special case where this question makes sense and can, to some extent, be answered — this is the case where our goal is not to build an uncertainty model “from scratch,” ...
متن کاملA Robust and Efficient Mixed-Integer Non-Linear Dynamic Optimization Approach for Simultaneous Design and Control
In this work, we propose a new algorithm for addressing the simultaneous design and control problem through the robust and efficient solution of a Mixed-Integer Dynamic Optimization (MIDO) problem. The algorithm is based on the transformation of the MIDO problem into a Mixed-Integer Nonlinear Programming (MINLP) program through the discretization of the MIDO problem. In this approach both the m...
متن کاملA Robust Knapsack Based Constrained Portfolio Optimization
Many portfolio optimization problems deal with allocation of assets which carry a relatively high market price. Therefore, it is necessary to determine the integer value of assets when we deal with portfolio optimization. In addition, one of the main concerns with most portfolio optimization is associated with the type of constraints considered in different models. In many cases, the resulted p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Industrial & Engineering Chemistry Research
سال: 2011
ISSN: 0888-5885,1520-5045
DOI: 10.1021/ie200150p